Network Convergence in the Presence of Omission Faults
نویسندگان
چکیده
Network Convergence in the presence of various fault modes has been studied for completely connected networks extensively. However, complete connectivity is impractical for large distributed systems. In addition, to attain network convergence for partially connected systems, most research presume message relays by intervening nodes. In other words, the network is logically converted to a completely connected network. This research obtains the Global Network Convergence and the Fault Tolerance for a large octagonal torus in the presence of Omission faults without message relays. The analysis uses the Fault-Tolerant Midpoint voting algorithm. This research will reveal the challenging task of expanding the results into a general case of any network topology, in combination with any voting algorithm, involving different fault modes.
منابع مشابه
Using Omissive Faults to Obtain Local Convergence in Partially Connected Networks
Approximate Agreement is an important issue in faulttolerant distributed computing where non-faulty processes exchange and vote upon their local values, to arrive at values which are within the range of the initial values of the nonfaulty processes and within a predefined tolerance of each other. Results to date in Approximate Agreement, however, are not capable of exploiting omission faults. O...
متن کاملDetection of Single and Dual Incipient Process Faults Using an Improved Artificial Neural Network
Changes in the physicochemical conditions of process unit, even under control, may lead to what are generically referred to as faults. The cognition of causes is very important, because the system can be diagnosed and fault tolerated. In this article, we discuss and propose an artificial neural network that can detect the incipient and gradual faults either individually or mutually. The mai...
متن کاملFault Identification using end-to-end data by imperialist competitive algorithm
Faults in computer networks may result in millions of dollars in cost. Faults in a network need to be localized and repaired to keep the health of the network. Fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. In this paper, we propose a novel approach based on imperialist competitive alg...
متن کاملFault Identification using end-to-end data by imperialist competitive algorithm
Faults in computer networks may result in millions of dollars in cost. Faults in a network need to be localized and repaired to keep the health of the network. Fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. In this paper, we propose a novel approach based on imperialist competitive alg...
متن کاملA generalized ABFT technique using a fault tolerant neural network
In this paper we first show that standard BP algorithm cannot yeild to a uniform information distribution over the neural network architecture. A measure of sensitivity is defined to evaluate fault tolerance of neural network and then we show that the sensitivity of a link is closely related to the amount of information passes through it. Based on this assumption, we prove that the distribu...
متن کامل